Voting Power : A Generalised Framework
نویسندگان
چکیده
This paper examines an area of Game Theory called Voting Power Theory. With the adoption of a measure theoretic framework it argues that the many different indices and tools currently used for measuring voting power can be replaced by just three simple probabilities. The framework is sufficiently general to be applicable to every conceivable type of voting game, and every possible decision rule.
منابع مشابه
A New Voting Model For Groups With Members of Unequal Power and Proficiency
To proposing a voting model for groups with members of unequal power and proficiency, we present some models for rank ordering efficient candidates, by extending the ideas of some authors. Then, we propose a new methodology to rank the ranking models for the performance indices of only DEA efficient candidates based on a classical voting model. Also, an approach for combining the results obtain...
متن کاملPower Indices as an Aid to Institutional Design: the Generalised Apportionment Problem
A priori voting power analysis can be useful in helping to design a weighted voting system that has certain intended properties. Power indices can help determine how many weighted votes each member should be allocated and what the decision rule should be. These choices can be made in the light of a requirement that there be a given distribution of power and/or a desired division of powers betwe...
متن کاملAn improved approach for ranking the candidates in a voting system based on efficiency intervals
This paper proposes improvements and revisions to a recent approach in a voting system, and provides an effective approach with a stronger discriminate power. For this purpose, the advantage of a linear transformation is utilized to redene a previously used concept of virtual worst candidate, by incorporating the existing weight restrictions. Then, the best score of this virtual candidate is us...
متن کاملA Note on Voting
A framework is presented in which to analyze the power of players in a cooperative game in which only certain coalitions are allowed. The allowable coalitions are characterized by a closure operator that combinatorially abstracts the notion of convexity. The Shapley-Shubik index is extended to this situation, allowing a computation of the power of each player. One example of this framework, vot...
متن کاملSub-committee Approval Voting and Generalised Justified Representation Axioms
Social choice is replete with various settings including single-winner voting, multi-winner voting, probabilistic voting, multiple referenda, and public decision making. We study a general model of social choice called Sub-Committee Voting (SCV) that simultaneously generalizes these settings. We then focus on sub-committee voting with approvals and propose extensions of the justified representa...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/1201.4743 شماره
صفحات -
تاریخ انتشار 2012